Stochastic reranking of biomedical search results based on extracted entities
نویسندگان
چکیده
Health-related information is nowadays accessible from many sources and is one of the most searched-for topics on the internet. However, existing search systems often fail to provide users with a good list of medical search results, especially for classic (keyword-based) queries. In this paper we elaborate on whether and how we can exploit biomedicine-related entities from the emerging Web of Data for improving (through re-ranking) the results returned by a search system. The aim is to promote relevant but low-ranked hits containing entities that are important to the current search context. We introduce an approach that is based on entity extraction applied on the retrieved documents, yielding a graph of documents along with entities which in turn is analyzed probabilistically using a Random Walk-based method. The proposed approach is independent of the submitted query and the underlying retrieval models, and thus can be applied over any ranked list of medical search results. Evaluation results using the dataset of TREC Clinical Decision Support track demonstrate that the proposed approach can significantly improve the results returned by classic and widely applicable retrieval models. The results also enabled us to identify cases where the proposed re-ranking method fails to improve the ranking.
منابع مشابه
Towards Supporting Exploratory Search over the Arabic Web Content: The Case of ArabXplore
Due to the huge amount of data published on the Web, the Web search process has become more difficult, and it is sometimes hard to get the expected results, especially when the users are less certain about their information needs. Several efforts have been proposed to support exploratory search on the web by using query expansion, faceted search, or supplementary information extracted from exte...
متن کاملPageRank without Hyperlinks: Reranking with Related Document Networks
Graph analysis algorithms such as PageRank and HITS have been successful in Web environments because they are able to extract important inter-document relationships from manually-created hyperlinks. We consider the application of these algorithms to related document networks comprised of automatically-generated content-similarity links. Specifically, this work tackles the problem of document re...
متن کاملA Survey On Visual Search Reranking
Due to the explosive growth of online video data and images , visual search is becoming an important area of research. Most existing approaches used text based image retrieval which is not so efficient. To precisely specify the visual documents, Visual search reranking is used. Visual search reranking is the rearrangement of visual documents based on initial search results or some external know...
متن کاملQuantification of Parkinson Tremor Intensity Based On EMG Signal Analysis Using Fast Orthogonal Search Algorithm
The tremor injury is one of the common symptoms of Parkinson's disease. The patients suffering from Parkinson's disease have difficulty in controlling their movements owing to tremor. The intensity of the disease can be determined through specifying the range of intensity values of involuntary tremor in Parkinson patients. The level of disease in patients is determined through an empirical rang...
متن کاملA stochastic network design of bulky waste recycling – a hybrid harmony search approach based on sample approximation
Facing supply uncertainty of bulky wastes, the capacitated multi-product stochastic network design model for bulky waste recycling is proposed in this paper. The objective of this model is to minimize the first-stage total fixed costs and the expected value of the second-stage variable costs. The possibility of operation costs and transportation costs for bulky waste recycling is considered ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JASIST
دوره 68 شماره
صفحات -
تاریخ انتشار 2017